PRIMALITY TESTING AND FACTORINGFINN J; LIEBERHERR K.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 211-215; BIBL. 6 REF.Article

LANGUAGES AND HIGH-PERFORMANCE COMPUTATIONSKUCK D; PADUA D; SAMEH A et al.1982; RELATIONSHIP BETWEEN NUMERICAL COMPUTATION AND PROGRAMMING LANGUAGES./WORKING CONFERENCE 1981-08-03/BOULDER COI; NLD/USA/GBR; AMSTERDAM; NEW YORK; OXFORD: NORTH-HOLLAND; DA. 1982; PP. 205-221; BIBL. 14 REF.Conference Paper

DATA STRUCTURES FOR SPARSE MATRICESREID JK.1982; RELATIONSHIP BETWEEN NUMERICAL COMPUTATION AND PROGRAMMING LANGUAGES./WORKING CONFERENCE 1981-08-03/BOULDER COI; NLD/USA/GBR; AMSTERDAM; NEW YORK; OXFORD: NORTH-HOLLAND; DA. 1982; PP. 153-161; BIBL. 2 REF.Conference Paper

ON BASIC CONCEPTS IN PARALLEL NUMERICAL MATHEMATICSSCHENDEL U.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 373-394; BIBL. 32 REF.Conference Paper

SUR LA LIAISON ENTRE PROBLEMES COMBINATOIRES ET ALGORITHMIQUESVAZENIN JM.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 1; PP. 33-41; BIBL. 10 REF.Article

THE INFLUENCE OF THE ALGORITHMIC POINT OF VIEW ON MATHEMATICS AND SCIENCESTRAUB JB.1979; PERSPECTIVES SUR LA RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE. 10EME ANNIVERSAIRE DE L'INSTITUT DE RECHERCHE D'INFORMATIQUE ET D'AUTOMATIQUE. COLLOQUE/1978/PARIS; FRA; ROCQUENCOURT: IRIA; DA. 1979; PP. 43-50; BIBL. 3 REF.Conference Paper

PARALLEL NON-LINEAR ALGORITHMSFEILMEIER M; ROENSCH W.1982; COMPUT. PHYS. COMMUN.; ISSN 0010-4655; NLD; DA. 1982; VOL. 26; NO 3/4; PP. 335-348; BIBL. 15 REF.Conference Paper

ELEMENTS DE CALCUL NUMERIQUE DES FONCTIONS DE REPARTITION RELATIVES A LA REPRESENTATION TRIDIMENSIONNELLE DES TEXTURES ET AU TRACE AUTOMATIQUE DES FIGURES DE POLES CORRESPONDANTES.DURAND G.1977; ; S.L.; DA. 1977; PP. 1-5; H.T. 137; (THESE (ANNEXE) DOCT. UNIV., MENTION MATH. SPEC. ALGORITHMIQUE NUMER.; PAUL-SABATIER TOULOUSE)Thesis

HIERARCHICAL DISCRETE SYSTEMS AND REALISATION OF PARALLEL ALGORITHMSKASABOV NK; BIJEV GT; JECHEV BJ et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 414-422; BIBL. 7 REF.Conference Paper

THE DESIGN AND IMPLEMENTATION OF THE NAG MASTER LIBRARY FILE SYSTEM.RICHARDSON MG; HAGUE SJ.1977; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1977; VOL. 7; NO 1; PP. 127-137; BIBL. 5 REF.Article

A SURVEY OF ANALYSIS TECHNIQUES FOR DISCRETE ALGORITHMS.WEIDE B.1977; COMPUTG SURV.; U.S.A.; DA. 1977; VOL. 9; NO 4; PP. 291-313; BIBL. 2 P.Article

A PERFORMANCE ANALYSIS OF A SIMPLE PRIME-TESTING ALGORITHMWUNDERLICH MC.1983; MATHEMATICS OF COMPUTATION; ISSN 0025-5718; USA; DA. 1983; VOL. 40; NO 162; PP. 709-714; BIBL. 7 REF.Article

ON THE AVERAGE-CASE COMPLEXITY OF "BUCKETING" ALGORITHMSAKL SG; MEIJER H.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 1; PP. 9-13; BIBL. 15 REF.Article

QUELQUES ALGORITHMES DE PERMUTATIONS.VIENNOT G.1976; ASTERISQUE; FR.; DA. 1976; NO 38-39; PP. 275-293; BIBL. 1 P. 1/2; (JOURN. ALGORITHMIQUES. CONF.; PARIS; 1975)Conference Paper

DESIGN ISSUES AND ARCHITECTURE OF HACIENDA, AND EXPERIMENTAL IMAGE PROCESSING SYSTEMFRANCHI P; GONZALEZ J; MANTEY P et al.1983; IBM JOURNAL OF RESEARCH AND DEVELOPMENT; ISSN 0018-8646; USA; DA. 1983; VOL. 27; NO 2; PP. 116-126; BIBL. 18 REF.Article

MAPPING INTEGERS AND HENSEL CODES ONTO FAREY FRACTIONSKORNERUP P; GREGORY RT.1983; BIT (NORDISK TIDSKRIFT FOR INFORMATIONSBEHANDLING); ISSN 0006-3835; SWE; DA. 1983; VOL. 23; NO 1; PP. 9-20; BIBL. 4 REF.Article

ALGORITHMIC SEARCH IN MANAGEMENT DECISION SYSTEMSMADEO LA; SCHRIBER TJ.1980; INT. J. MAN-MACH. STUD.; ISSN 0020-7373; GBR; DA. 1980; VOL. 13; NO 4; PP. 423-435; BIBL. 20 REF.Article

CONCURRENT ALGORITHMS FOR ROOT SEARCHINGERIKSEN O; STAUNSTRUP J.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 4; PP. 361-376; BIBL. 3 REF.Article

MINIMAL ALGORITHMS FOR BILINEAR FORMS MAY HAVE DIVISIONSFEIG E.1983; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1983; VOL. 4; NO 1; PP. 81-84; BIBL. 10 REF.Article

THE TOWERS OF HANOR REVISITED: MOVING THE RINGS BY COUNTING THE MOVESWALSH TR.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 2; PP. 64-67; BIBL. 5 REF.Article

A CONSTANT-TIME PARELLEL ALGORITHM FOR COMPUTING CONVEX HULLSAKL SG.1982; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1982; VOL. 22; NO 2; PP. 130-134; BIBL. 14 REF.Article

CONTINUOUS RELAXATION AND LOCAL MAXIMA SELECTION: CONDITIONS FOR EQUIVALENCEZUCKER SW; LECLERC YG; MOHAMMED JL et al.1981; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1981; VOL. 3; NO 2; PP. 117-127; BIBL. 28 REF.Article

ALGORITHMICAL COMPLEXITY OF SOME STATISTICAL DECISION PROCESSES. ISINDERLAR J.1980; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1980; VOL. 16; NO 4; PP. 345-356Article

FUNCTION MINIMISATION USING THE NELDER AND MEAD SIMPLEX METHOD WITH LIMITED-ARITHMETIC PRECISION: THE SELF REGENERATIVE SIMPLEX.AKITT JW.1977; COMPUTER J.; G.B.; DA. 1977; VOL. 20; NO 1; PP. 84-85; BIBL. 5 REF.Article

LE MEILLEUR ALGORITHME D'EUCLIDE POUR K(X) ET Z.LAZARD D.1977; C.R. ACAD. SCI, A; FR.; DA. 1977; VOL. 284; NO 1; PP. 1-4; ABS. ANGL.; BIBL. 1 REF.Article